The "Art of Trellis Decoding" Is NP-Hard
نویسنده
چکیده
Given a linear code C, the fundamental problem of trellis decoding is to find a coordinate permutation of C that yields a code C ′ whose minimal trellis has the least state-complexity among all codes obtainable by permuting the coordinates of C. By reducing from the problem of computing the pathwidth of a graph, we show that the problem of finding such a coordinate permutation is NP-hard, thus settling a long-standing conjecture.
منابع مشابه
The 'Art of Trellis Decoding' Is Computationally Hardi - For Large Fields
The problem of minimizing the trellis complexity of a code by coordinate permutation is studied. Three measures of trellis complexity are considered: the total number of states, the total number of edges, and the maximum state complexity of the trellis. The problem is proven NP-hard for all three measures, provided the eld over which the code is speciied is not xed. We leave open the problem of...
متن کاملViterbi Decoding of Convolutional Codes
At the receiver, we have a sequence of voltage samples corresponding to the parity bits that the transmitter has sent. For simplicity, and without loss of generality, we will assume 1 sample per bit. In the previous lecture, we assumed that these voltages have been digitized to form a received bit sequence. If we decode this received bit sequence, the decoding process is termed hard decision de...
متن کاملDesigning a Stochastic Multi-Product Closed Loop Supply Chain Network Considering the Discount and Solving Using the Firefly Algorithm with Decoding Based on Priority
The closed loop supply chain is becoming one of the industry's most important areas of business, due to environmental and business factors. Planning and implementing a closed loop supply chain network provide more profit, customer satisfaction, and a good social image to the company. While most supply chain networks are not equipped with back-up channels, this paper presents a mixed integer non...
متن کاملMatroid Pathwidth and Code Trellis Complexity
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from the problem of computing the pathwidth of a graph, we show that the problem of determining the pathwidth of a representable matroid is NP-hard. Consequently, the problem of computing the trellis-width of a linear code...
متن کاملHybrid Maximum-likelihood Detector for Trellis Coded Spatial Modulation
Most spatial modulation (SM) schemes in the literature use hard-output maximumlikelihood (ML) antenna index detection. In trellis coded spatial modulation (TCSM) scheme, the detection should be also performed for the transmitted symbol, while the sequence decoding is performed using a hard-output Viterbi algorithm. We modified the hard-output ML-SM detector to determine a soft estimate of the t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007